Spectral approach to linear programming bounds on codes
نویسندگان
چکیده
منابع مشابه
Spectral approach to linear programming bounds on codes
We give a new asymptotic upper bound on the size of a code in the Grassmannian space. The bound is better than the upper bounds known previously in the entire range of distances except very large values. the problem of estimating the number of planes whose pairwise distances are bounded below by some given value δ, for a suitably defined distance function d(p, q). This problem has attracted att...
متن کاملec 2 00 5 SPECTRAL APPROACH TO LINEAR PROGRAMMING BOUNDS ON CODES
We give new proofs of asymptotic upper bounds of coding theory obtained within the frame of Delsarte's linear programming method. The proofs rely on the analysis of eigenvectors of some finite-dimensional operators related to orthogonal polynomials. The examples of the method considered in the paper include binary codes, binary constant-weight codes, spherical codes, and codes in the projective...
متن کاملLinear Programming Bounds for Distributed Storage Codes
A major issue of locally repairable codes is their robustness. If a local repair group is not able to perform the repair process, this will result in increasing the repair cost. Therefore, it is critical for a locally repairable code to have multiple repair groups. In this paper we consider robust locally repairable coding schemes which guarantee that there exist multiple alternative local repa...
متن کاملBounds for Unrestricted Codes , by Linear Programming
The paper describes a problem of linear programming associated with distance properties of unrestricted codes. As a solution to the problem, one obtains an .upper bound for the number of words in codes having a prescribed set of distances. 1. Introduetion Important information about a code is contained in its Hamming distance distribution, defined as follows: for a q-ary code C of length n, it ...
متن کاملOn Linear Programming Bounds for Spherical Codes and Designs
We investigate universal bounds on spherical codes and spherical designs that could be obtained using Delsarte’s linear programming methods. We give a lower estimate for the LP upper bound on codes, and an upper estimate for the LP lower bound on designs. Specifically, when the distance of the code is fixed and the dimension goes to infinity, the LP upper bound on codes is at least as large as ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Problems of Information Transmission
سال: 2006
ISSN: 0032-9460,1608-3253
DOI: 10.1134/s0032946006020025